Tense θ-valued Moisil propositional logic
نویسندگان
چکیده
منابع مشابه
Ãlukasiewicz - Moisil Many - Valued Logic Algebra of Highly - Complex Systems
The fundamentals of à Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces...
متن کاملEmbedding Gödel propositional logic into Prior’s tense logic
The well-known Gödel translation embeds intuitionistic propositional logic into the modal logic S4. In this note, we use essentially the same translation to embed Gödel infinitevalued propositional logic into a schematic extension of Prior’s bimodal tense logic that allows finite chains only as flows of time. While our proofs use elementary techniques in many-valued algebraic logic, our embeddi...
متن کاملA Four-Valued Fuzzy Propositional Logic
It is generally accepted that knowledge based systems would be smarter and more robust if they can manage inconsistent, incomplete or imprecise knowledge. This paper is about a four-valued fuzzy propositional logic, which is the result of the combination of a four-valued logic and a fuzzy propositional logic. Besides the nice computational properties, the logic enables us also to deal both with...
متن کاملTense Operators on MV-Algebras and Lukasiewicz-Moisil Algebras
We introduce the tense LMn-algebras and the tense MV algebras as algebraic structures for some tense many-valued logics. A representation theorem for tense LMn-algebras is proved and the polynomially equivalence between tense LM3-algebras (resp. tense LM4-algebras) and tense MV3-algebras (resp. tense MV4-algebras) is established. We study the pairs of dually-conjugated operations on MV -algebra...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2010
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2010.5.2220